Higher-order logic

Results: 178



#Item
31Lambda calculus / Computability theory / Theoretical computer science / Logic in computer science / Combinatory logic / Recursion / Term / Free variables and bound variables / Lambda calculus definition

BRICS Basic Research in Computer Science BRICS RSDanvy & Rose: Higher-Order Rewriting and Partial Evaluation Higher-Order Rewriting and

Add to Reading List

Source URL: repository.readscheme.org

Language: English - Date: 2010-10-22 08:06:09
32Lambda calculus / Combinatory logic / Church encoding / Fixed-point combinator / Anonymous function / Higher-order abstract syntax / Type system / Unification / De Bruijn index / Lambda calculus definition

Self-applicable Partial Evaluation for Pure Lambda Calculus Torben Æ. Mogensen DIKU, University of Copenhagen, Denmark Abstract

Add to Reading List

Source URL: repository.readscheme.org

Language: English - Date: 2010-10-22 08:04:54
33Category theory / Functional programming / F-algebra / F-coalgebra / Functor / Initial algebra / Monad / Equivalence of categories / Coalgebra / Stoneech compactification

Foundational, Compositional (Co)datatypes for Higher-Order Logic Category Theory Applied to Theorem Proving Dmitriy Traytel Technische Universität München Munich, Germany

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-01-25 16:18:54
34

Higher-Order Representation Predicates in Separation Logic Arthur Charguéraud Inria, Université Paris-Saclay, France LRI, CNRS & Univ. Paris-Sud, Université Paris-Saclay, France

Add to Reading List

Source URL: chargueraud.org

Language: English - Date: 2015-12-17 11:18:09
    35Computability theory / Proof theory / Mathematical logic / Metalogic / Reverse mathematics / Primitive recursive functional / Second-order arithmetic / Peano axioms / Primitive recursive function / Primitive recursive arithmetic / Model theory / Symbol

    FOUNDATIONAL AND MATHEMATICAL USES OF HIGHER TYPES ULRICH KOHLENBACH† DEDICATED TO SOLOMON FEFERMAN FOR HIS 70TH BIRTHDAY §1. Introduction. A central theme of proof theory is expressed by the following question:

    Add to Reading List

    Source URL: www.mathematik.tu-darmstadt.de

    Language: English - Date: 2012-11-12 10:34:29
    36

    Separation Logic for a Higher-Order Typed Language [Extended Abstract] Neelakantan Krishnaswami Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213

    Add to Reading List

    Source URL: www.mpi-sws.org

    Language: English - Date: 2006-02-16 10:22:45
      37

      Modular Verification of the Subject-Observer Pattern via Higher-Order Separation Logic Neelakantan R. Krishnaswami, Jonathan Aldrich1 , and Lars Birkedal2 1 Carnegie Mellon University, {neelk, aldrich}@cs.cmu.edu

      Add to Reading List

      Source URL: www.mpi-sws.org

      Language: English - Date: 2007-08-09 13:58:58
        38Logic / Automated theorem proving / Logic programming / Logical truth / Propositional calculus / Substitution

        Nunchaku: Flexible Model Finding for Higher-Order Logic Simon Cruanes, Jasmin Blanchette, Andrew Reynolds Veridis, Inria Nancy https://cedeela.fr/~simon/ April 7th, 2016

        Add to Reading List

        Source URL: cedeela.fr

        Language: English - Date: 2016-04-07 05:17:04
        39

        Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic Neelakantan R. Krishnaswami CMU-CSJuly 6, 2011

        Add to Reading List

        Source URL: www.mpi-sws.org

        Language: English - Date: 2012-06-01 04:55:15
          40

          REDUCING HIGHER-ORDER THEOREM PROVING TO A SEQUENCE OF SAT PROBLEMS CHAD E. BROWN Abstract. We describe a complete theorem proving procedure for higher-order logic that uses SAT-solving to do much of the

          Add to Reading List

          Source URL: www.ps.uni-saarland.de

          Language: English - Date: 2012-05-02 11:18:24
            UPDATE